Eecient Second-order Matching ?
نویسندگان
چکیده
The standard second-order matching algorithm by Huet may be expansive in matching a exible-rigid pair. On one hand, many fresh free variables may need to be introduced; on the other hand, attempts are made to match the heading free variable on the exible side with every \top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the \top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected \top layers", arguments of the heading free variable and subterms covered by the corresponding \top layers". A rst implementation shows that the new algorithm is more eecient both in time and space than the standard one for a great number of matching problems.
منابع مشابه
Stereo Matching of Color Images using Differential Invariants
In this paper, we present a new method for matching points in stereoscopic, uncalibrated color images. Our approach works on point primitives and consists rst in using a point characterization based on diierential invariants, deened until now for gray value images. Then we deene additional invariants of rst order, exploiting color information. The characterization obtained is invariant to ortho...
متن کاملDiierential Invariants for Color Images
In this paper, we present a new method for matching points in stereoscopic, uncalibrated color images. Our approach consists rst in characterizing points of interest using diierential invariants. Then we deene additional invariants of rst order, exploiting color information. We show that this contribution makes the characterization suucient till rst order. In addition, we make our description r...
متن کاملMixed Finite Element Methods on Nonmatching Multiblock Grids
We consider mixed nite element methods for second order elliptic equations on non-matching multiblock grids. A mortar nite element space is introduced on the non-matching interfaces. We approximate in this mortar space the trace of the solution, and we impose weakly a continuity of ux condition. A standard mixed nite element method is used within the blocks. Optimal order convergence is shown f...
متن کاملArchitectures for Hierarchical and otherBlock Matching
Hierarchical block matching is an eecient motion estimation technique which provides an adaptation of the block size and the search area to the properties of the image. In this work, we propose two novel special-purpose architectures to implement hierarchical block matching for real-time applications. The rst architecture is memory-eecient, but requires a large external memory bandwidth and a l...
متن کاملEecient Matching of Space Curves Eecient Matching of Space Curves ?
Reference 1] Tomm a s Pajdla and Luc Van Gool. EEcient matching of space curves. Abstract. The aim is to provide invariant signatures for matching space curves under Euclidean motions. Semi-diierential rather than diierential invariants can be used for the description and recognition of space curves. They have the advantage of being more robust, but on the other hand introduce the problem of nd...
متن کامل